#define _CRT_SECURE_NO_WARNINGS 1
#include"HashTable.h"
#include<iostream>
#include<unordered_map>
#include<unordered_set>
using namespace std;

void test_uset()
{
	unordered_set<int> u;
	u.insert(5);
	u.insert(4);
	u.insert(1);
	u.insert(3);
	u.insert(6);
	auto it = u.begin();
	while (it != u.end())
	{
		cout << *it << " ";
		it++;
	}
}

int main()
{
	//test_uset();
	LinkHash::HashTable<int, int> hs;
	hs.Insert(make_pair(1, 2));
	hs.Insert(make_pair(11, 2));
	hs.Insert(make_pair(21, 2));
	hs.Insert(make_pair(31, 2));
	hs.Insert(make_pair(41, 2));
	hs.Insert(make_pair(51, 2));
	hs.Insert(make_pair(61, 2));
	hs.Insert(make_pair(71, 2));
	hs.Insert(make_pair(81, 2));
	hs.Insert(make_pair(91, 2));
	hs.Insert(make_pair(22, 2));
	hs.Insert(make_pair(51, 2));
	hs.Insert(make_pair(51, 2));
	hs.Erase(1);
	hs.Erase(11);
	hs.Erase(21);
	hs.Erase(31);
	hs.Erase(41);
	hs.Erase(51);
	hs.Erase(61);
	hs.Erase(71);
	hs.Erase(81);
	hs.Erase(91);
	hs.Erase(22);

	return 0;
}